Linear Ramified Higher Type Recursion and Parallel Complexity
نویسندگان
چکیده
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.
منابع مشابه
Higher-Order Linear Ramified Recurrence
Higher-Order Linear Ramified Recurrence (HOLRR) is a PTIME sound and complete typed lambda caluclus. Its terms are those of a linear (affine) λ-calculus – every variable occurs at most once – extended with a limited recursive scheme on a word algebra. Completeness for PTIME holds by embedding Leivant’s ramified recurrence on words into HOLRR. Soundness is established at all types – and not only...
متن کاملHigher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.
متن کاملRamified Structural Recursion and Corecursion
We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cookstyle normal/safe typed programming formalism, RS1 , that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel asp...
متن کاملParallel computable higher type functionals - Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
The primary aim of this paper is to introduce higher type analogues of some familiar parallel complexity classes, and to show that these higher type classes can be characterized in significantly different ways. Recursion-theoretic, proof-theoretic and machine-theoretic characterizations are given for various classes, providing evidence of their naturalness. In this section, we motivate the appr...
متن کاملPredicative Analysis of Feasibility and Diagonalization
Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of Bellantoni and Cook, and Leivant. Here, we refine predicative analysis by using a ramified Ackermann’s con10 struction of a non-primitive recursive function. We obtain an hierarchy of functions which characterizes exactly func...
متن کامل